Berge Multiplication for Monotone Boolean Dualization
نویسندگان
چکیده
Given the prime CNF representation φ of a monotone Boolean function f : {0, 1} 7→ {0, 1}, the dualization problem calls for finding the corresponding prime DNF representation ψ of f . A very simple method (called Berge multiplication [3, Page 52–53]) works by multiplying out the clauses of φ from left to right in some order, simplifying whenever possible using the absorption law. We show that for any monotone CNF φ, Berge multiplication can be done in subexponential time, and for many interesting subclasses of monotone CNF’s such as CNF’s with bounded size, bounded degree, bounded intersection, bounded conformality, and read-once formula, it can be done in polynomial or quasi-polynomial time.
منابع مشابه
On Berge Multiplication for Monotone Boolean Dualization
Given the prime CNF representation φ of a monotone Boolean function f : {0, 1} 7→ {0, 1}, the dualization problem calls for finding the corresponding prime DNF representation ψ of f . A very simple method (called Berge multiplication [3, Page 52–53]) works by multiplying out the clauses of φ from left to right in some order, simplifying whenever possible using the absorption law. We show that f...
متن کاملOn the Complexity of the Multiplication Method for Monotone CNF/DNF Dualization
Given the irredundant CNF representation φ of a monotone Boolean function f : {0, 1} 7→ {0, 1}, the dualization problem calls for finding the corresponding unique irredundant DNF representation ψ of f . The (generalized) multiplication method works by repeatedly dividing the clauses of φ into (not necessarily disjoint) groups, multiplying-out the clauses in each group, and then reducing the res...
متن کاملNon-monotone Dualization via Monotone Dualization
The non-monotone dualization (NMD) is one of the most essential tasks required for finding hypotheses in various ILP settings, like learning from entailment [1, 2] and learning from interpretations [3]. Its task is to generate an irredundant prime CNF formula ψ of the dual f where f is a general Boolean function represented by CNF [4]. The DNF formula φ of f is easily obtained by De Morgan’s la...
متن کاملDualization in lattices given by ordered sets of irreducibles
Dualization of a monotone Boolean function on a finite lattice can be represented by transforming the set of its minimal 1 to the set of its maximal 0 values. In this paper we consider finite lattices given by ordered sets of their meet and join irreducibles (i.e., as a concept lattice of a formal context). We show that in this case dualization is equivalent to the enumeration of so-called mini...
متن کاملEnumerating Minimal Hypotheses and Dualizing Monotone Boolean Functions on Lattices
Any monotone Boolean function on a lattice can be described by the set of its minimal 1 values. If a lattice is given as a concept lattice, this set can be represented by the set of minimal hypotheses of a classification context. Enumeration of minimal hypotheses in output polynomial time is shown to be impossible unless P = NP, which shows that dualization of monotone functions on lattices wit...
متن کامل